Imprimitive ninth-degree number fields with small discriminants
نویسندگان
چکیده
منابع مشابه
Imprimitive Ninth-degree Number Fields with Small Discriminants
We present tables of ninth-degree nonprimitive (i.e., containing a cubic subfield) number fields. Each table corresponds to one signature, except for fields with signature (3,3), for which we give two dilferent tables depending on the signature of the cubic subfield. Details related to the computation of the tables are given, as well as information about the CPU time used, the number of polynom...
متن کاملMinimum Discriminants of Imprimitive Decic Fields
In this paper, we compute the minimum discriminants of imprimitive degree 10 fields for different combinations of Galois group and signature. We use class field theory when there is a quintic subfield, and a Martinet search in the more difficult case where there is only a quadratic subfield. If L is a degree n number field, let DL be its discriminant, and dL := |DL| its absolute discriminant. L...
متن کاملCounting discriminants of number fields
For each transitive permutation group G on n letters with n ≤ 4, we give without proof results, conjectures, and numerical computations on discriminants of number fields L of degree n over Q such that the Galois group of the Galois closure of L is isomorphic to G.
متن کاملNumber fields with solvable Galois groups and small Galois root discriminants
We apply class field theory to compute complete tables of number fields with Galois root discriminant less than 8πeγ . This includes all solvable Galois groups which appear in degree less than 10, groups of order less than 24, and all dihedral groups Dp where p is prime. Many people have studied questions of constructing complete lists of number fields subject to conditions on degree and possib...
متن کاملOn Arithmetically Equivalent Number Fields of Small Degree
For each integer n, let Sn be the set of all class number quotients h(K)/h(K ′) for number fields K and K ′ of degree n with the same zeta-function. In this note we will give some explicit results on the finite sets Sn, for small n. For example, for every x ∈ Sn with n ≤ 15, x or x is an integer that is a prime power dividing 2 · 3 · 5.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1995
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1995-1260128-x